Wire Crossing Constrained QCA Circuit Design using Bilayer Logic Decomposition

Quantum-dot Cellular Automata (QCA) seek potential benefits over CMOS devices such as low power consumption, small dimensions, and high speed operation. Two prominent QCA concerns of wire crossing complexity and circuit robustness are addressed by developing a three-step Bilayer Logic Decomposition (BLD) methodology to design QCA-based logic circuits. The partitioning of QCA computing operations into logic layers realizes considerable improvements in complexity, area, and modularity metrics. Moreover, since larger circuits are divided into two increasingly disjoint sub-planes, verification of the functionality of the design becomes compartmentalized. Design capability of the proposed approach is illustrated and analysed by implementing an area-efficient Full Comparator (FC) based on a novel logic realization. The resulting 1-bit FC achieves 32% improvement in complexity metrics in comparison with the previous optimal QCA-based FC. The related waveforms used in verification of the BLD-generated FC which are obtained by the QCADesigner simulation tool are discussed as a motivating example of the BLD methodology.